Infinitely many finite one-regular graphs of any even valency

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Infinitely many one-regular Cayley graphs on dihedral groups of any prescribed valency

A graph is one-regular if its automorphism group acts regularly on the arc set. In this paper, we construct a new infinite family of one-regular Cayley graphs of any prescribed valency. In fact, for any two positive integers , k 2 except for ( , k) ∈ {(2,3), (2,4)}, the Cayley graph Cay(Dn,S) on dihedral groups Dn = 〈a, b | an = b2 = (ab)2 = 1〉 with S = {a1+ +···+ t b | 0 t k − 1} and n = ∑k−1 ...

متن کامل

Finite 1 - Regular Cayley Graphs of Valency 5

Let Γ = Cay(G, S) and G ≤ X ≤ AutΓ. We say Γ is (X, 1)-regular Cayley graph if X acts regularly on its arcs. Γ is said to be corefree if G is core-free in some X ≤ Aut(Cay(G, S)). In this paper, we prove that if an (X, 1)-regular Cayley graph of valency 5 is not normal or binormal, then it is the normal cover of one of two core-free ones up to isomorphism. In particular, there are no core-free ...

متن کامل

The Distance-Regular Graphs of Valency Four

We show that each distance-regular graph of valency four has known parameters.

متن کامل

Maps, One-regular Graphs and Half-transitive Graphs of Valency 4

A subgroup G of automorphisms of a graph X is said to be 1 2-transitive if it is vertex and edge but not arc-transitive. The graph X is said to be 1 2-transitive if Aut X is 1 2-transitive. The graph X is called one-regular if Aut X acts regularly on the set arcs of X. The interplay of three diierent concepts of maps, one-regular graphs and 1 2-transitive group actions on graphs of valency 4 is...

متن کامل

Erdõs regular graphs of even degree

In 1960, Dirac put forward the conjecture that r-connected 4critical graphs exist for every r ≥ 3. In 1989, Erdős conjectured that for every r ≥ 3 there exist r-regular 4-critical graphs. A method for finding r-regular 4-critical graphs and the numbers of such graphs for r ≤ 10 have been reported in [6, 7]. Results of a computer search for graphs of degree r = 12, 14, 16 are presented. All the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series B

سال: 2004

ISSN: 0095-8956

DOI: 10.1016/s0095-8956(03)00084-4